Date: Wed, 08 Jan 1997 20:53:11 GMT
Server: NCSA/1.4.2
Content-type: text/html

<!DOCTYPE HTML PUBLIC "-//W3O//DTD W3 HTML 2.0//EN">
<!Converted with LaTeX2HTML 95 (Thu Jan 19 1995) by Nikos Drakos (nikos@cbl.leeds.ac.uk), CBLU, University of Leeds >
<HEAD>
<TITLE>CSE 322 
Winter Quarter 1996</TITLE>
</HEAD>
<BODY>
<meta name="description" value="CSE 322 
Winter Quarter 1996">
<meta name="keywords" value="syllabus">
<meta name="resource-type" value="document">
<meta name="distribution" value="global">
<P>
<center>
<H1>CSE 322 
Winter Quarter 1996</H1>
</center>
<P><STRONG></STRONG><P>
<P><STRONG></STRONG><P>
<P>
<HR>
<H1><A NAME=SECTION00010000000000000000> Instructor</A></H1>
<P>
<!WA0><!WA0><a href="http://www.cs.washington.edu/homes/ladner/">Richard Ladner</a><BR> 
<!WA1><!WA1><a href="mailto:ladner@cs.washington.edu">ladner@cs.washington.edu</a><BR>
Office: Sieg 311, 543-9347<BR> 
<P>
Office hours:<BR> 
Tu 11-12<BR> 
Th 11-12<BR>
<P>
<BR> <HR>
<H1><A NAME=SECTION00020000000000000000> Teaching Assistant</A></H1>
<P>
<!WA2><!WA2><a href="http://www.cs.washington.edu/homes/fix/">Jim Fix</a><BR> 
<!WA3><!WA3><a href="mailto:fix@cs.washington.edu">fix@cs.washington.edu</a><BR>
<P>
office hours<BR> 
	W 12:30-1:30 Room 326A Sieg<BR> 
	Th 1:30-2:30 Room 326A Sieg<BR>
<P>
<BR> <HR>
<H1><A NAME=SECTION00030000000000000000> Text</A></H1>
<P>
Languages and Machines, An Introduction to the Theory of Computer Science<BR> 
Thomas A. Sudkamp<BR> 
Addison-Wesley Publishing Company, Inc.<BR>
<P>
<BR> <HR>
<H2><A NAME=SECTION00031000000000000000> Text Coverage</A></H2>
<P>
<UL><LI>
Chapter 1 - Mathematical Preliminaries - read on your own.
<LI>
Chapter 2 - Languages - languages model basic decision problems in computing.
<LI>
Chapter 3 - Context-Free Grammars - the theory behind how computer languages are
defined structurally.
<LI>
Chapter 4 - Parsing: An Introduction - how grammars are used to define parsers.
<LI>
Chapter 6 - Finite Automata - formalization of program execution.
<LI>
Chapter 7 - Regular Languages and Sets - basic properties of languages defined
by finite automata.
<LI>
Chapter 8 - Pushdown Automata and Context-Free Languages - theory behind parsing
of computer languages.
<LI>
Chapter 9 - Turing Machines - theory behind all computational systems.
<LI>
Chapter 11 - Decidability - Why some problems cannot be solved by a computer.
</UL><BR> <HR>
<H1><A NAME=SECTION00040000000000000000> Exams</A></H1>
<P>
<UL><LI> Midterm - Wednesday, January 31, 1996
<LI> Final - Wednesday March 13, 1996
</UL><BR> <HR>
<H1><A NAME=SECTION00050000000000000000> Homework</A></H1>
<P>
Homework is due every Friday at the beginning of class.  Please leave on the 
table near the door.  Late homeworks are not accepted unless you make a
request before it is due.
<P>
A normal homework will consist of a combination of problems from the book and my
own problems.  Generally, problems from the book will give you a chance to 
practice some of the derivations and constructions used in the theory of
computation.  Generally, my problems will be more challenging and may require 
developing proofs.
<P>
<BR> <HR>
<H1><A NAME=SECTION00060000000000000000> Grading</A></H1>
<P>
<UL><LI> Homework 25%
<LI> Midterm 25%
<LI> Final 50%
</UL><BR> <HR>
<H1><A NAME=SECTION00070000000000000000>   About this document ... </A></H1>
<P>
 <STRONG>CSE 322 
Winter Quarter 1996</STRONG><P>
This document was generated using the <!WA4><!WA4><A HREF="http://cbl.leeds.ac.uk/nikos/tex2html/doc/latex2html/latex2html.html"><STRONG>LaTeX</STRONG>2<tt>HTML</tt></A> translator Version 95 (Thu Jan 19 1995) Copyright &#169; 1993, 1994,  <!WA5><!WA5><A HREF="http://cbl.leeds.ac.uk/nikos/personal.html">Nikos Drakos</A>, Computer Based Learning Unit, University of Leeds. <P> The command line arguments were: <BR>
<STRONG>latex2html</STRONG> <tt>syllabus.tex</tt>. <P>The translation was initiated by James Fix on Fri Jan  5 13:22:10 PST 1996<BR> <HR>
<P><ADDRESS>
<I>James Fix <BR>
Fri Jan  5 13:22:10 PST 1996</I>
</ADDRESS>
</BODY>
